On the Differential Polynomial of a Graph

We introduce the differential polynomial of a graph. The differential polynomial of a graph G of order n is the polynomial B(G; x) :=∑?(G)k=-nB_k(G) x~(n+k), where B_k(G) denotes the number of vertex subsets of G with differential equal to k. We state some properties of B(G;x) and its coefficients.In particular, we compute the differential polynomial for complete, empty, path, cycle, wheel and double star graphs. We also establish some relationships between B(G; x) and the differential polynomials of graphs which result by removing, adding, and subdividing an edge from G.     

Pervasive electrochemistry

Journal of Solid State Electrochemistry -     

The raised-cosine wavelets in computerized tomography

In Computerized Tomography (CT), an image must be recovered from its sampled projections in the form of values of the Radon transform. In this work a method of recovering the image is based on the properties of the raised-cosine wavelet. This wavelet has a closed form which allows for certain precomputations and avoids convolution. The rate of convergence of the resulting algorithm to the image density function is found under suitable hypotheses. This algorithm is then tested on the standard Shepp–Logan